Evaluating the robustness of objective pilling classification with the two-dimensional discrete wavelet transform

Previously, we proposed a new method of frequency domain analysis based on the two-dimensional discrete wavelet transform to objectively measure pilling intensity in sample fabric images. We have further evaluated this method, and our results indicate that it is robust to small horizontal and/or vertical translations and to significant variations in the brightness of the image under analysis, and is sensitive to rotation and to dilation of the image. These results suggest that as long as precautions are taken to ensure fabric test samples are imaged under consistent conditions of weave/knit pattern alignment (rotation) and apparent interyarn pitch (dilation), the method will yield repeatable results. <br /

Optimisation of material properties for the modelling of large deformation manufacturing processes using a finite element model of the Gleeble compression test

The finite element modelling of manufacturing processes often requires a large amount of large plastic strain flow stress data in order to represent the material of interest over a wide range of temperatures and strain rates. Compression data generated using a Gleeble thermo-mechanical simulator is difficult to interpret due to the complex temperature and strain fields, which exist within the specimen during the test. In this study, a non-linear optimisation process is presented, which includes a finite element model of the compression process to accurately determine the constants of a five-parameter Norton–Hoff material model. The optimisation process is first verified using a reduced three-parameter model and then the full five-parameter model using a known set of constants to produce the target data, from which the errors are assessed. Following this, the optimisation is performed using experimental target data starting from a set of constants derived from the test data using an initial least-squares fit and also an arbitrary starting point within the parameter space. The results of these tests yield coefficients differing by a maximum of less than 10% and significantly improve the representation of the flow stress of the material

Modeling drying kinetics of thyme (thymus vulgaris l.): theoretical and empirical models, and neural networks

[EN] The drying kinetics of thyme was analyzed by considering different conditions: air temperature of between 40 C and 70 C, and air velocity of 1 m/s. A theoretical diffusion model and eight different empirical models were fitted to the experimental data. From the theoretical model application, the effective diffusivity per unit area of the thyme was estimated (between 3.68 10 5 and 2.12 10 4 s 1). The temperature dependence of the effective diffusivity was described by the Arrhenius relationship with activation energy of 49.42 kJ/mol. Eight different empirical models were fitted to the experimental data. Additionally, the dependence of the parameters of each model on the drying temperature was determined, obtaining equations that allow estimating the evolution of the moisture content at any temperature in the established range. Furthermore, artificial neural networks were developed and compared with the theoretical and empirical models using the percentage of the relative errors and the explained variance. The artificial neural networks were found to be more accurate predictors of moisture evolution with VAR 99.3% and ER 8.7%.The authors acknowledge the financial support from the 'Ministerio de Educacion y Ciencia' in Spain, CONSOLIDER INGENIO 2010 (CSD2007-00016).Rodríguez Cortina, J.; Clemente Polo, G.; Sanjuán Pellicer, MN.; Bon Corbín, J. (2014). Modeling drying kinetics of thyme (thymus vulgaris l.): theoretical and empirical models, and neural networks. Food Science and Technology International. 20(1):13-22. https://doi.org/10.1177/1082013212469614S132220

Real-time information processing of environmental sensor network data using Bayesian Gaussian processes

In this article, we consider the problem faced by a sensor network operator who must infer, in real time, the value of some environmental parameter that is being monitored at discrete points in space and time by a sensor network. We describe a powerful and generic approach built upon an efficient multi-output Gaussian process that facilitates this information acquisition and processing. Our algorithm allows effective inference even with minimal domain knowledge, and we further introduce a formulation of Bayesian Monte Carlo to permit the principled management of the hyperparameters introduced by our flexible models. We demonstrate how our methods can be applied in cases where the data is delayed, intermittently missing, censored, and/or correlated. We validate our approach using data collected from three networks of weather sensors and show that it yields better inference performance than both conventional independent Gaussian processes and the Kalman filter. Finally, we show that our formalism efficiently reuses previous computations by following an online update procedure as new data sequentially arrives, and that this results in a four-fold increase in computational speed in the largest cases considered

Defects and boundary layers in non-Euclidean plates

We investigate the behavior of non-Euclidean plates with constant negative Gaussian curvature using the F\"oppl-von K\'arm\'an reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic profile. We prove rigorous upper and lower bounds for the elastic energy that scales like the thickness squared. In particular we show that are only two types of global minimizers -- deformations that remain flat and saddle shaped deformations with isolated regions of stretching near the edge of the annulus. We also show that there exist local minimizers with a periodic profile that have additional boundary layers near their lines of inflection. These additional boundary layers are a new phenomenon in thin elastic sheets and are necessary to regularize jump discontinuities in the azimuthal curvature across lines of inflection. We rigorously derive scaling laws for the width of these boundary layers as a function of the thickness of the sheet

Computation of the real structured singular value via pole migration

peer-reviewedThe paper introduces a new computationally efficient algorithm to determine a lower bound on the real structured singular value . The algorithm is based on a pole migration approach where an optimization solver is used to compute a lower bound on real independent of a frequency sweep. A distinguishing feature of this algorithm from other frequency independent one-shot tests is that multiple localized optima (if they exist) are identified and returned from the search. This is achieved by using a number of alternative methods to generate different initial conditions from which the optimization solver can initiate its search from. The pole migration algorithm presented has also been extended to determine lower bounds for complex parametric uncertainties as well as full complex blocks. However, the results presented are for strictly real and repeated parametric uncertainty problems as this class of problem is the focus of this paper and are in general the most difficult to solve. Copyright (c) 2014 John Wiley & Sons, Ltd.ACCEPTEDpeer-reviewe

Algorithm 873: LSTRS: MATLAB Software for Large-Scale Trust-Region Subproblems and Regularization

A MATLAB 6.0 implementation of the LSTRS method is presented. LSTRS was described in Rojas et al. [2000]. LSTRS is designed for large-scale quadratic problems with one norm constraint. The method is based on a reformulation of the trust-region subproblem as a parameterized eigenvalue problem, and consists of an iterative procedure that finds the optimal value for the parameter. The adjustment of the parameter requires the solution of a large-scale eigenvalue problem at each step. LSTRS relies on matrix-vector products only and has low and fixed storage requirements, features that make it suitable for large-scale computations. In the MATLAB implementation, the Hessian matrix of the quadratic objective function can be specified either explicitly, or in the form of a matrix-vector multiplication routine. Therefore, the implementation preserves the matrix-free nature of the method. A description of the LSTRS method and of the MATLAB software, version 1.2, is presented. Comparisons with other techniques and applications of the method are also included. A guide for using the software and examples are provided.34

Integral transform solution of random coupled parabolic partial differential models

[EN] Random coupled parabolic partial differential models are solved numerically using random cosine Fourier transform together with non-Gaussian random numerical integration that captures the highly oscillatory behaviour of the involved integrands. Sufficient condition of spectral type imposed on the random matrices of the system is given so that the approximated stochastic process solution and its statistical moments are numerically convergent. Numerical experiments illustrate the results.Spanish Ministerio de Economia, Industria y Competitividad (MINECO); Agencia Estatal de Investigacion (AEI); Fondo Europeo de Desarrollo Regional (FEDER UE), Grant/Award Number: MTM2017-89664-PCasabán Bartual, MC.; Company Rossi, R.; Egorova, VN.; Jódar Sánchez, LA. (2020). Integral transform solution of random coupled parabolic partial differential models. Mathematical Methods in the Applied Sciences. 43(14):8223-8236. https://doi.org/10.1002/mma.6492S822382364314Bäck, J., Nobile, F., Tamellini, L., & Tempone, R. (2010). Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison. Spectral and High Order Methods for Partial Differential Equations, 43-62. doi:10.1007/978-3-642-15337-2_3Bachmayr, M., Cohen, A., & Migliorati, G. (2016). Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients. ESAIM: Mathematical Modelling and Numerical Analysis, 51(1), 321-339. doi:10.1051/m2an/2016045Ernst, O. G., Sprungk, B., & Tamellini, L. (2018). Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs). SIAM Journal on Numerical Analysis, 56(2), 877-905. doi:10.1137/17m1123079Sheng, D., & Axelsson, K. (1995). Uncoupling of coupled flows in soil—a finite element method. International Journal for Numerical and Analytical Methods in Geomechanics, 19(8), 537-553. doi:10.1002/nag.1610190804Mitchell, J. K. (1991). Conduction phenomena: from theory to geotechnical practice. Géotechnique, 41(3), 299-340. doi:10.1680/geot.1991.41.3.299Das, P. K. (1991). Optical Signal Processing. doi:10.1007/978-3-642-74962-9Ashkenazy, Y. (2017). Energy transfer of surface wind-induced currents to the deep ocean via resonance with the Coriolis force. Journal of Marine Systems, 167, 93-104. doi:10.1016/j.jmarsys.2016.11.019Hodgkin, A. L., & Huxley, A. F. (1952). A quantitative description of membrane current and its application to conduction and excitation in nerve. The Journal of Physiology, 117(4), 500-544. doi:10.1113/jphysiol.1952.sp004764Galiano, G. (2012). On a cross-diffusion population model deduced from mutation and splitting of a single species. Computers & Mathematics with Applications, 64(6), 1927-1936. doi:10.1016/j.camwa.2012.03.045Casabán, M. C., Company, R., & Jódar, L. (2019). Numerical solutions of random mean square Fisher‐KPP models with advection. Mathematical Methods in the Applied Sciences, 43(14), 8015-8031. doi:10.1002/mma.5942Casabán, M. C., Company, R., & Jódar, L. (2019). Numerical Integral Transform Methods for Random Hyperbolic Models with a Finite Degree of Randomness. Mathematics, 7(9), 853. doi:10.3390/math7090853Shampine, L. F. (2008). Vectorized adaptive quadrature in MATLAB. Journal of Computational and Applied Mathematics, 211(2), 131-140. doi:10.1016/j.cam.2006.11.021Iserles, A. (2004). On the numerical quadrature of highly-oscillating integrals I: Fourier transforms. IMA Journal of Numerical Analysis, 24(3), 365-391. doi:10.1093/imanum/24.3.365Ma, J., & Liu, H. (2018). On the Convolution Quadrature Rule for Integral Transforms with Oscillatory Bessel Kernels. Symmetry, 10(7), 239. doi:10.3390/sym10070239Jódar, L., & Goberna, D. (1996). Exact and analytic numerical solution of coupled diffusion problems in a semi-infinite medium. Computers & Mathematics with Applications, 31(9), 17-24. doi:10.1016/0898-1221(96)00038-7Jódar, L., & Goberna, D. (1998). A matrix D’Alembert formula for coupled wave initial value problems. Computers & Mathematics with Applications, 35(9), 1-15. doi:10.1016/s0898-1221(98)00052-2Ostrowski, A. M. (1959). A QUANTITATIVE FORMULATION OF SYLVESTER’S LAW OF INERTIA. Proceedings of the National Academy of Sciences, 45(5), 740-744. doi:10.1073/pnas.45.5.740Ashkenazy, Y., Gildor, H., & Bel, G. (2015). The effect of stochastic wind on the infinite depth Ekman layer model. EPL (Europhysics Letters), 111(3), 39001. doi:10.1209/0295-5075/111/3900

Graphical user interfaces in an engineering educational environment

Graphical user interfaces (GUIs) are being increasingly used in the classroom to provide users of computer simulations with a friendly and visual approach to specifying all input parameters and increased configuration flexibility. In this study, the authors first describe a number of software and language options that are available to build GUIs. Subsequently, a comprehensive comparative assessment of possible alternatives is undertaken in the light of a benchmark educational program used in a course on computational fluid dynamics (CFD) at the University of Michigan. For the GUIs presented, their educational value with respect to flexible data entry and post-processing of results has been demonstrated. In addition, the authors offer recommendations for pros and cons of available options in terms of platform independence, ease of programming, facilitation of interaction with students, and flexibility. © 2005 Wiley Periodicals, Inc. Comput Appl Eng Educ 13: 48–59, 2005; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/cae.20029Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/35190/1/20029_ftp.pd

Intelligent sampling for the measurement of structured surfaces

Uniform sampling in metrology has known drawbacks such as coherent spectral aliasing and a lack of efficiency in terms of measuring time and data storage. The requirement for intelligent sampling strategies has been outlined over recent years, particularly where the measurement of structured surfaces is concerned. Most of the present research on intelligent sampling has focused on dimensional metrology using coordinate-measuring machines with little reported on the area of surface metrology. In the research reported here, potential intelligent sampling strategies for surface topography measurement of structured surfaces are investigated by using numerical simulation and experimental verification. The methods include the jittered uniform method, low-discrepancy pattern sampling and several adaptive methods which originate from computer graphics, coordinate metrology and previous research by the authors. By combining the use of advanced reconstruction methods and feature-based characterization techniques, the measurement performance of the sampling methods is studied using case studies. The advantages, stability and feasibility of these techniques for practical measurements are discussed